如今，越来越多的应用程序是开发用于在分布式分区技术，即DAPP上运行。 DAPP的业务逻辑通常在通过稳定性开发的智能合同中实现，该编程语言用于在不同区间平台上编写智能合同，包括流行的以太统计。在Ethereum中，在矿工机器上运行的智能合同对应于执行费补偿这种计算资源的执行费用。但是，智能合同的部署和执行成本取决于开发人员完成的实施选择。未申请的设计选择可能导致较高的煤气消耗量比必要的消耗更高。在本文中，我们（i）确定了一套影响智能合同部署和交易成本的19个稳定性味道，（ii）通过涉及34名参与者的调查评估这种嗅觉的相关性。在这些嗅觉之上，我们提出了Gasmet，这是一套统计评估智能合同的代码质量的指标。涉及2,186个智能合同的实验表明，拟议的指标具有与部署成本的直接关联。我们套件中的指标可用于更容易地识别需要优化的源代码段。

The 1$^{\text{st}}$ Workshop on Maritime Computer Vision (MaCVi) 2023 focused on maritime computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface Vehicle (USV), and organized several subchallenges in this domain: (i) UAV-based Maritime Object Detection, (ii) UAV-based Maritime Object Tracking, (iii) USV-based Maritime Obstacle Segmentation and (iv) USV-based Maritime Obstacle Detection. The subchallenges were based on the SeaDronesSee and MODS benchmarks. This report summarizes the main findings of the individual subchallenges and introduces a new benchmark, called SeaDronesSee Object Detection v2, which extends the previous benchmark by including more classes and footage. We provide statistical and qualitative analyses, and assess trends in the best-performing methodologies of over 130 submissions. The methods are summarized in the appendix. The datasets, evaluation code and the leaderboard are publicly available at https://seadronessee.cs.uni-tuebingen.de/macvi.

该技术报告描述了在Robocup SPL（Mario）中计算视觉统计的模块化且可扩展的体系结构，该结构在Robocup 2022的SPL Open Research Challenge期间提出，该挑战在曼谷（泰国）举行。马里奥（Mario）是一个开源的，可用的软件应用程序，其最终目标是为Robocup SPL社区的发展做出贡献。Mario带有一个GUI，该GUI集成了多个机器学习和基于计算机视觉的功能，包括自动摄像机校准，背景减法，同型计算，玩家 +球跟踪和本地化，NAO机器人姿势估计和跌落检测。马里奥（Mario）被排名第一。1在开放研究挑战中。

队列研究越来越多地使用加速度计进行体育活动和久坐行为估计。这些设备往往比自我报告易于错误，可以全天捕获活动，并且是经济的。但是，在自由生活的情况下和受试者对象变化下，基于髋关节wor的数据估算久坐行为的先前方法通常是无效的或次优的。在本文中，我们提出了一个本地马尔可夫切换模型，该模型考虑了这种情况，并引入了一种姿势分类和久坐行为分析的一般程序，该程序自然适合该模型。我们的方法在时间序列中具有更改点检测方法，也是一个两个阶段分类步骤，将数据标记为3类（坐着，站立，步进）。通过严格的训练测试范例，我们表明我们的方法达到了80％的精度。此外，我们的方法是强大的，易于解释。

Associazione Medici Diabetologi（AMD）收集并管理着全球最大的糖尿病患者记录集合之一，也称为AMD数据库。本文介绍了一个正在进行的项目的初步结果，该项目的重点是人工智能和机器学习技术的应用，以概念化，清洁和分析如此重要且有价值的数据集，目的是提供预测性见解，以更好地支持糖尿病学家的诊断糖尿病学家和治疗选择。

Computational units in artificial neural networks follow a simplified model of biological neurons. In the biological model, the output signal of a neuron runs down the axon, splits following the many branches at its end, and passes identically to all the downward neurons of the network. Each of the downward neurons will use their copy of this signal as one of many inputs dendrites, integrate them all and fire an output, if above some threshold. In the artificial neural network, this translates to the fact that the nonlinear filtering of the signal is performed in the upward neuron, meaning that in practice the same activation is shared between all the downward neurons that use that signal as their input. Dendrites thus play a passive role. We propose a slightly more complex model for the biological neuron, where dendrites play an active role: the activation in the output of the upward neuron becomes optional, and instead the signals going through each dendrite undergo independent nonlinear filterings, before the linear combination. We implement this new model into a ReLU computational unit and discuss its biological plausibility. We compare this new computational unit with the standard one and describe it from a geometrical point of view. We provide a Keras implementation of this unit into fully connected and convolutional layers and estimate their FLOPs and weights change. We then use these layers in ResNet architectures on CIFAR-10, CIFAR-100, Imagenette, and Imagewoof, obtaining performance improvements over standard ResNets up to 1.73%. Finally, we prove a universal representation theorem for continuous functions on compact sets and show that this new unit has more representational power than its standard counterpart.

Humans have internal models of robots (like their physical capabilities), the world (like what will happen next), and their tasks (like a preferred goal). However, human internal models are not always perfect: for example, it is easy to underestimate a robot's inertia. Nevertheless, these models change and improve over time as humans gather more experience. Interestingly, robot actions influence what this experience is, and therefore influence how people's internal models change. In this work we take a step towards enabling robots to understand the influence they have, leverage it to better assist people, and help human models more quickly align with reality. Our key idea is to model the human's learning as a nonlinear dynamical system which evolves the human's internal model given new observations. We formulate a novel optimization problem to infer the human's learning dynamics from demonstrations that naturally exhibit human learning. We then formalize how robots can influence human learning by embedding the human's learning dynamics model into the robot planning problem. Although our formulations provide concrete problem statements, they are intractable to solve in full generality. We contribute an approximation that sacrifices the complexity of the human internal models we can represent, but enables robots to learn the nonlinear dynamics of these internal models. We evaluate our inference and planning methods in a suite of simulated environments and an in-person user study, where a 7DOF robotic arm teaches participants to be better teleoperators. While influencing human learning remains an open problem, our results demonstrate that this influence is possible and can be helpful in real human-robot interaction.

Explainability is a vibrant research topic in the artificial intelligence community, with growing interest across methods and domains. Much has been written about the topic, yet explainability still lacks shared terminology and a framework capable of providing structural soundness to explanations. In our work, we address these issues by proposing a novel definition of explanation that is a synthesis of what can be found in the literature. We recognize that explanations are not atomic but the product of evidence stemming from the model and its input-output and the human interpretation of this evidence. Furthermore, we fit explanations into the properties of faithfulness (i.e., the explanation being a true description of the model's decision-making) and plausibility (i.e., how much the explanation looks convincing to the user). Using our proposed theoretical framework simplifies how these properties are ope rationalized and provide new insight into common explanation methods that we analyze as case studies.

Fruit is a key crop in worldwide agriculture feeding millions of people. The standard supply chain of fruit products involves quality checks to guarantee freshness, taste, and, most of all, safety. An important factor that determines fruit quality is its stage of ripening. This is usually manually classified by experts in the field, which makes it a labor-intensive and error-prone process. Thus, there is an arising need for automation in the process of fruit ripeness classification. Many automatic methods have been proposed that employ a variety of feature descriptors for the food item to be graded. Machine learning and deep learning techniques dominate the top-performing methods. Furthermore, deep learning can operate on raw data and thus relieve the users from having to compute complex engineered features, which are often crop-specific. In this survey, we review the latest methods proposed in the literature to automatize fruit ripeness classification, highlighting the most common feature descriptors they operate on.

Graph Neural Networks (GNNs) achieve state-of-the-art performance on graph-structured data across numerous domains. Their underlying ability to represent nodes as summaries of their vicinities has proven effective for homophilous graphs in particular, in which same-type nodes tend to connect. On heterophilous graphs, in which different-type nodes are likely connected, GNNs perform less consistently, as neighborhood information might be less representative or even misleading. On the other hand, GNN performance is not inferior on all heterophilous graphs, and there is a lack of understanding of what other graph properties affect GNN performance. In this work, we highlight the limitations of the widely used homophily ratio and the recent Cross-Class Neighborhood Similarity (CCNS) metric in estimating GNN performance. To overcome these limitations, we introduce 2-hop Neighbor Class Similarity (2NCS), a new quantitative graph structural property that correlates with GNN performance more strongly and consistently than alternative metrics. 2NCS considers two-hop neighborhoods as a theoretically derived consequence of the two-step label propagation process governing GCN's training-inference process. Experiments on one synthetic and eight real-world graph datasets confirm consistent improvements over existing metrics in estimating the accuracy of GCN- and GAT-based architectures on the node classification task.